A Randomized Approximation Scheme for Metric MAX-CUT
نویسندگان
چکیده
Metric MAX-CUT is the problem of dividing a set of points in metric space into two parts so as to maximize the sum of the distances between points belonging to distinct parts. We show that metric MAX-CUT has a polynomial time randomized approximation scheme.
منابع مشابه
Approximating generalizations of Max Cut
This thesis is written for the Swedish degree Licentiate of Science, teknisk licentiat. It is a university degree, intermediate between that of master and that of doctor. We study the approximability of different generalizations of the Max Cut problem. First, we show that Max Set Splitting and Max Not-All-Equal Sat are both approximable within 1.380 in probabilistic polynomial time. The algorit...
متن کاملRandomized Approximation Algorithms
We have seen several randomized approximation algorithms before. Recall that for the MAXCUT and MAX-3SAT problems we proved that choosing any solution uniformly at random gives a constant factor approximation in the expectation. For MAX-CUT the approximation factor was 2. For MAX-3SAT, a random assignment of truth values to a variable satisfies a given clause with probability 78 . In the case o...
متن کاملApproximation algorithms for maximum cut with limited unbalance
We consider the problem of partitioning the vertices of a weighted graph into two sets of sizes that differ at most by a given threshold B, so as to maximize the weight of the crossing edges. For B equal to 0 this problem is known as Max Bisection, whereas for B equal to the number n of nodes it is the Maximum Cut problem. We present polynomial time randomized approximation algorithms with non ...
متن کاملRank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
The Goemans-Williamson randomized algorithm guarantees a high-quality approximation to the Max-Cut problem, but the cost associated with such an approximation can be excessively high for large-scale problems due to the need for solving an expensive semidefinite relaxation. In order to achieve better practical performance, we propose an alternative, rank-two relaxation and develop a specialized ...
متن کاملRandomized Approximation of MAX-CUT
1 Last Class In the previous class we discussed averaging arguments, derandomization, the method of conditional expectation, and looked at the general technique of relaxation and randomized rounding with respect to MAX-SAT. To solve (approximate) MAX-SAT, we relaxed the requirement that the variables be boolean and instead let them take on real values in the interval 0; 1]. We then solved the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 63 شماره
صفحات -
تاریخ انتشار 1998